Routing data based on comparative income values

ABSTRACT

Data is dynamically routed between first and second locations. An attempt success ratio is obtained for each of several data paths capable of providing a data link between the first and second locations, where such ratio represents a proportion of successful linkages by the data path to all attempted linkages by the data path between the first and second locations. A revenue value is also obtained for each data path, where such value represents an amount per unit generated by a successful linkage by the data path between the first and second locations. A comparative income value is then computed for each data path, where such value is a product of the attempt success ratio for the data path and the revenue value for the data path. Routing information is then selected for routing the data between the first and second locations based on the comparative income value for each data path. The routing information may be employed to route the data by way of at least one of the data paths.

TITLE OF THE INVENTION

Routing Data Based On Comparative Income Values

FIELD OF THE INVENTION

The present invention relates generally to routing data between firstand second locations based on a comparative income value calculated foreach of a plurality of available routings. More particularly, thepresent invention relates to routing the data based on which routingwill generate the most income to the routing entity or which routingwill result in the least expense to the routing entity.

BACKGROUND OF THE INVENTION

In recent years, a number of new telephone service features have beenprovided by an Advanced Intelligent Network (AIN). The AIN evolved outof a need to increase the capabilities of the telephone networkarchitecture in order to meet the growing needs of telephone customersor users. Additionally, as the number of people who rely on the Internetfor communication increases, so does the demand for the electronictransfer of data.

Referring now to FIG. 1, it is seen that an AIN-based networkarrangement is provided within and/or in conjunction with a telephonesystem LATA (Local Access and Transport Area)101 that defines a callingservice area. The LATA 101 includes stations (i.e. telephone lines andtelephone equipment at the ends thereof) 103 and corresponding serviceswitching points (SSPs) 105 (i.e., end offices or central offices). TheSSPs 105 are each programmable switches which: recognize AIN-type calls;launch queries to service control points (SCPs) 107 (only one beingshown in FIG. 1); and receive commands and data from SCPs 107 to furtherprocess and route AIN-type calls. A signal transfer point (STP) 109 maybe employed to route signals between the SSPs 105, the SCPs 107, andother network elements. When one of the SSPs 105 is triggered by anAIN-type call, the triggered SSP 105 formulates an AIN service requestand responds to call processing instructions from the network element inwhich the AIN service logic resides, typically at an SCP 107.

In a telephone system such as those in LATA 101, and absent otherconsiderations, each SSP 105 routes a call from a station 103 coupledthereto and at a first location to a second location according to agenerally static routing table that is included with or locallyavailable to such SSP 105 (not shown). As may be appreciated, the secondlocation may be any location, including a location within the LATA 101,external to the LATA 101 but relatively local, or external to the LATA101 and not relatively local, e.g.

However, and importantly, the information in a static routing table canquickly become old or ‘stale’. That is, such information is typicallyselected to optimize one or more parameters and is based on thetelephone or data network within which calls/data are to be routed, andyet such telephone or data network can be expected to change on a minuteby minute or even second by second basis. For example, a particularrouting may go down at any time, or the operator of such routing mayincrease a usage cost rate at any time. In contrast with such a dynamicenvironment, the static routing table typically, is updated once every24 hours or so. Therefore, the information that the routing tablecontains and uses to route calls/data quickly becomes obsolete. As is tobe appreciated, usage of such obsolete information quickly becomesinefficient and costly.

Accordingly, a need exists for a cost effective method of routingcalls/data between a first location and a second location using currentreal time information. In particular, a need exists for a method ofrouting calls/data that generates maximum revenue or that incurs theleast cost to the routing entity.

SUMMARY OF THE INVENTION

The present invention satisfies the aforementioned need by providing amethod of dynamically routing data between a first location and a secondlocation. In the method, an attempt success ratio is obtained for eachof a plurality of data paths capable of providing a data link betweenthe first location and the second location. The attempt success ratiofor each data path is representative of a proportion of successfullinkages by the data path to all attempted linkages by the data pathbetween the first location and the second location.

Additionally, a revenue value is obtained for each of the plurality ofdata paths. The revenue value for each data path is representative of anamount per unit generated by a successful linkage by the data pathbetween the first location and the second location. A comparative incomevalue is then computed for each of the plurality of data paths, wherethe comparative income value for each data path is a product of theattempt success ratio for the data path and the revenue value for thedata path.

Routing information is then selected for routing the data between thefirst location and the second location based on the comparative incomevalue for each of the data paths. The routing information may beemployed to route the data by way of at least one of the data paths.

BRIEF DESCRIPTION OF THE FIGURES

The foregoing summary as well as the following detailed description ofthe invention will be better understood when read in conjunction withthe appended drawings. For the purpose of the illustrating theinvention, there are shown in the drawings embodiments which arepresently preferred. As should be understood, however, the invention isnot limited to the precise arrangements and instrumentalities shown. Inthe drawings:

FIG. 1 is a block diagram and shows an Advanced Intelligent Network(AIN) based system for implementing intelligent network managementfeatures, such as that which may be employed in connection with thepresent invention;

FIG. 2 illustrates a chart showing a routing table including informationemployed to make routing decisions in accordance with one embodiment ofthe present invention; and

FIG. 3 illustrates a method of dynamically routing data such as atelephone call between a first location and a second location inaccordance with one embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

In the present invention, data is dynamically routed between a firstlocation and a second location based on information available in acentralized routing table. The data is typically a telephone calloriginating from within a LATA 101 such as that shown in FIG. 1 or thelike. The first location and second location can be anywhere within theLATA 101 or at another LATA communicatively coupled to the LATA 101without departing from the spirit and scope of the invention. Typically,the telephone call is routed by way of a data path such as a trunk line,although it is to be appreciated that other types of data paths such asmicrowave links, satellite links, direct links, etc. may be employedwithout departing from the spirit and scope of the invention.

Although the present invention is disclosed in terms of a telephone callover a telephone network, it is nevertheless to be appreciated that thedata may be any other data, such as computer-type data or the like,without departing from the spirit and scope of the present invention.Moreover, such data can be transmitted by way of a network other than atelephone-type network, again without departing from the spirit andscope of the present invention. For example, the network may be acomputer-type network such as the Internet or a private computernetwork.

In a typical telephone network, a local carrier operating one or moreLATAs 101 typically completes calls within or between its LATAs 101 byway of data paths owned or controlled by such local carrier. Forinstance, local carrier A operating one or more LATAs 101 in theWilkes-Barre, Pa. area would route a call within the area by way oflines owned or controlled by such carrier A.

However, in the case where the call originates within the Wilkes-Barre,Pa. area but is destined for an area outside such the Wilkes-Barre, Pa.area, carrier A may have to route the call at least partially by way ofa data path that is not owned or controlled by carrier A. For instance,if the aforementioned call is destined for a telephone line in BoyntonBeach, Fla., carrier A may have to route the call at least partially byway of a long distance data path such as a trunk line operated by a longdistance carrier B. The actual mechanical details of routing calls aregenerally known or should be apparent to the relevant public andtherefore need not be discussed herein in any detail. Accordingly, anyappropriate method of performing routing of calls may be employedwithout departing from the spirit and scope of the present invention.

As discussed above, each SSP 105 operated by the local carrier A may beprovided with a static routing table includes all information necessaryfor routing the call from Wilkes-Barre, Pa. to Boynton Beach, Fla. Sucha routing table is known or should be apparent to the relevant public.Accordingly, further details of such static routing table are notprovided herein. Note that static routing tables or the like are alsoemployed by data routers to route data between first and secondlocations.

As also discussed above, the data in the static routing tables canquickly become stale. Moreover, continually updating the data in eachand every one of the far-flung tables at each and every one of thefar-flung SSPs 105 can quickly become an elaborate and perhaps unwieldyprocess. Accordingly, in one embodiment of the present invention, suchdata is centralized and stored in one or perhaps a small number ofcentralized locations. In particular, in one embodiment of the presentinvention, and as seen in FIG. 1, the routing table 10 is stored at oneor more SCPs 107, for example at a database 104 or the like which isincluded in or coupled to or accessible by the SCP 107.

Accordingly, to complete a call that requires routing information, anSSP 105 makes a request to an SCP 107 for such routing information, andthen completes the call based on the routing information as receivedfrom the SCP 107. As known, the request to the SCP 107 from the SSP 105may be based on the tripping of an appropriate trigger at the SSP 105when the call is being made. Requesting information from an SCP 107 byan SSP 105 is generally known or should be apparent to the relevantpublic and therefore need not be discussed herein in any detail.Moreover, any particular method of requesting the routing informationfrom the SCP 107 may be employed without departing from the spirit andscope of the present invention. Note that even with the routing table 10stored at the SCP 107, each SSP 105 should nevertheless have areasonably up-to-date backup routing table locally available in theevent the SCP 107 is out of operation or unable to communicate with theSSP 105.

In one embodiment of the present invention, the routing information inthe routing table 10 includes routing information for routing a callfrom a first location to a second location by way of a plurality of datapaths capable of providing a link between the first location and thesecond location. For example, for routing a call from Wilkes-Barre, Pa.to Boynton Beach, Fla., several different carriers B, C, etc. may havecorresponding data paths (trunk lines, e.g.) available for effectuatingthe link/call. Moreover, one or more of the carriers may each havemultiple alternative data paths available for effectuating the link. Forexample, and as seen in FIG. 2, carrier B may have a single data pathB1, while carrier C has three data paths C1, C2, C3.

Importantly, and as also seen in FIG. 2, for each data path B1, C1, C2,C3, the local carrier A associates a comparative value therewithindicative of how preferential the data path is, where the comparativevalues for all data paths between the first and second locations may becompared to determine a preferred data path. Such comparative value maybe derived in any appropriate manner without departing from the spiritand scope of the present invention. In one embodiment of the presentinvention, the comparative value for each data path is a function ofboth a revenue value associated with the data path and the likelihoodthe call will be successfully completed on the data path.

For each data path, the revenue value associated therewith preferablyhas monetary relevance to the local carrier A. For example, if the useof the data path requires an overall outlay by carrier A, then therevenue value may represent an overall cost to carrier A, perhapsexpressed in an appropriate per unit basis such as per unit of time(minute, e.g.). Here, overall cost may require a consideration of costpaid to owner/controller of the data path and also of value charged tothe customer for making the call to result in a net cost per unit.

Similarly, if the use of the data path results in an overall income tothe carrier A, then the revenue value may represent an overall income tocarrier A, again perhaps expressed in an appropriate per unit basis suchas per unit of time (minute, e.g.). Here, and also again, overall incomemay require a consideration of cost paid to the customer by theowner/controller of the data path directly and also of value charged tothe customer for making the call to result in a net profit per unit.Deriving a revenue value for each data path is generally known or shouldbe apparent to the relevant public and therefore need not be discussedin detail herein. Generally, any appropriate mechanism for deriving arevenue value for each data path may be employed without departing fromthe spirit and scope of the present invention.

As seen in FIG. 2, for carrier A, each of data paths B1, C1, C2, C3between Wilkes-Barre, Pa. and Boynton Beach, Fla. has a revenue value of0.10, 0.20, 0.50, and 0.90 dollars per minute, respectively. Forpurposes of the present example, the revenue value is representative ofnet profit to carrier A.

For each data path, the likelihood value associated therewith preferablyrelates to how often a call routed by carrier A through the data path issuccessfully completed. For example, suppose data path B1 successfullycompletes the data link nine times out of every ten attempted linkages.Data path B1 therefore has a 90% likelihood that a call attemptedtherethrough will be completed In one embodiment of the presentinvention, then, the likelihood value for each data path is an attemptsuccess ratio (ASR) representative of a proportion of successfullinkages by the data path to all attempted linkages by the data path.Deriving an ASR for each data path is generally known or should beapparent to the relevant public and therefore need not be discussed indetail herein. Generally, any appropriate mechanism for deriving an ASRfor each data path may be employed without departing from the spirit andscope of the present invention.

As seen in FIG. 2, for carrier A, each of data paths B1, C1, C2, C3between Wilkes-Barre, Pa. and Boynton Beach, Fla. has an ASR of 90, 70,20, and 10 percent, respectively.

Now, a question arises regarding why the ASR for each data path is evenconsidered. After all, if carrier A simply chooses to route the call byway of data path C3, such carrier A stands to gain a net profit of 0.90dollars per minute, which is far better than 0.10, 0.20, or 0.50 dollarsper minute based on data paths B1, C1, and C2, respectively. However,and importantly, carrier A gains such 0.90 dollars per minute net profitonly if the call is successfully completed by way of data path C3.Moreover, the ASR for data path C3 is only 10 percent, meaning that thecall will likely be successfully completed only 1 time in 10.

Accordingly, on an overall basis, carrier A will gain 0.90 dollars perminute 10 percent of the time, or 0.09 dollars per minute on an overallbasis. In one embodiment of the present invention, then, the comparativevalue for each data path is the revenue value associated with the datapath multiplied by the ASR for the path. Also, in such embodiment, thehighest comparative value (in a net profit scenario) or lowestcomparative value (in a net cost scenario) of a plurality of data pathscapable of providing a data link between a first location and a secondlocation represents the best routing choice.

As seen in FIG. 2, for carrier A, each of data paths B1, C1, C2, C3between Wilkes-Barre, Pa. and Boynton Beach, Fla. has a comparativevalue of 0.09, 0.14, 0.10 and 0.09 dollars per minute, respectively.Thus, data path C1 as provided by carrier C is the best routing choice,data path C2 as provided by carrier C is the second best routing choice,and data path B1 and C3 as provided by carriers B and C, respectively,tie for the third best routing choice. Of particular interest here isthat even though data path C1 has a revenue value of 0.20 dollars perminute, which is much less that the revenue value of 0.90 dollars perminute for data path C3, data path C1 is nevertheless preferred overdata path C3 because the ASR of 70 percent for data path C1 is so muchhigher than the ASR of 10 percent for data path C3.

Note that with regard to data path C3, for example, during the 9 timesout of 10 that the call fails to complete, carrier A will incur set upcosts for attempting to complete the call by way of such data path C3,and will otherwise tie up resources while the call waits to go through.Although the comparative value of the present invention does not takesuch set up costs and tied up resources into account, the relevantpublic should appreciate that the highest comparative value (in a netprofit scenario) or lowest comparative value (in a net cost scenario)nevertheless represents the best routing choice.

In one embodiment of the present invention, then, and referring now toFIG. 3, upon an SCP 107 receiving a request for routing information fora data link from an SSP 105, the SCP 107 obtains a revenue value foreach of a plurality of data paths capable of providing a data linkbetween the first location and the second location (step 301), and alsoobtains an attempt success ratio (ASR) for each of the plurality of datapaths (step 303). Thereafter, the SCP 107 computes a comparative valuefor each of the plurality of data paths, where the comparative value isthe product of the attempt success ratio for the data path and therevenue value for the data path (step 305).

Based on the comparative values, then, the SCP 107 selects a bestrouting choice for the data link based on the comparative value for eachdata path, and the corresponding routing information for routing thedata between the first location and the second location based on thebest routing choice (step 307). Such routing information is thenreturned to the requesting SSP 105 (step 309), and such SSP 105 may thenemploy the returned routing information to route the telephone call byway of at least one of the data paths (step 311).

In one embodiment of the present invention, the SCP 107 selects at step307 a plurality of best routing choices and therefore a correspondingplurality of data paths and a corresponding plurality of routinginformations based on the comparative income values for the data paths.That is, rather than just selecting data path C1 based on its being thebest routing choice, data path C2 may also be selected based on itsbeing the second best routing choice. Of course, additional data pathsmay also be selected without departing from the spirit and scope of thepresent invention. As may be appreciated, then all of the routinginformations for all of the selected data paths are then returned atstep 309 to the requesting SSP 105, and the SSP 105 can then employ atstep 311 any of the returned routing informations. Typically, one set ofrouting information represents a preferred set and another represents analternate set. Accordingly, the SSP 105 may employ the preferred set toroute the call, and if that fails the SSP 105 may employ the alternateset to route the call.

As set forth above, the comparative value for a data path is a functionof the revenue value for the data path and the ASR for the data path.However, the comparative value for a data path may be a function ofadditional values without departing from the spirit and scope of thepresent invention. For example, values representing current switchconditions, current network conditions, available resources, time ofday, and the like may be incorporated into a determination of thecomparative value for each data path.

In one embodiment of the present invention, the revenue value and ASRfor each data path as noted in the table 10 is updated on a regularbasis with current data. The periodicity of such updates is preferablyselected to avoid allowing such information to become stale.Particularly with regard to the ASR, this may require that updates beperformed in a period of hours or even minutes, or perhaps even seconds.By updating on what amounts to a real-time or near real-time basis, theuse of the most current revenue values and ASRs results in thecomputation of the most accurate comparative values and the mostmeaningful selection of routing information based on such comparativevalues.

In one embodiment of the present invention, and as seen in FIG. 1, thetable 10 receives such updates from one or more surveillance systems 12.As may be appreciated, each surveillance system 12 continually monitorsthe telecommunications system and continually calculates current revenuevalues and current ASRs based on available system information. Thesurveillance systems 12 are generally known or should be apparent to therelevant public and therefore need not be discussed herein in anydetail. Such systems 12 may be any appropriate systems without departingfrom the spirit and scope of the present invention.

As shown in FIG. 2, the revenue value, ASR, comparative value, androuting information for each data path is stored in the routing table 10at the SCP 107. Nevertheless, at least some of such information may bestored at a location other than the routing table 10 without departingfrom the spirit and scope of the present invention. For example, it maybe the case that only the routing information is in the routing table10, while the revenue value, ASR, and comparative value information isstored in another table at the SCP 107. Further, it may be the case thatthe information of FIG. 2 is stored at an SSP 105. Accordingly, theinformation may be stored in any appropriate manner and at anyappropriate location(s) without departing from the spirit and scope ofthe present invention.

Note that with regard to the computing of the comparative value (step305), such computation may be performed at any appropriate time and byany appropriate entity without departing from the spirit and scope ofthe present invention. For example, the computation may be performed bya loading entity as new revenue values and/or ASRs are loaded into table10 or the like, and stored with such revenue values and ASRs in thetable 10 or the like, or may be performed by an obtaining entity (theSCP 107, e.g.) as revenue values and ASRs are obtained (step 301, 303).In the latter case, the computed comparative values may be stored in thetable 10 or the like, or it may be the case that the comparative valuesare not stored anywhere.

As should now be understood, in the present invention, data such as atelephone call is dynamically routed from a first location to a secondlocation by way of one of a plurality of data paths based on acomparative value associated with each data path. Changes could be madeto the embodiments disclosed above without departing from the broadinventive concepts thereof. It is understood, therefore, that thisinvention is not limited to the particular embodiments disclosed, but itis intended to cover modifications within the spirit and scope of thepresent invention as defined by the appended claims.

What is claimed is:
 1. A method of dynamically routing data between afirst location and a second location, the method comprising: obtainingan attempt success ratio for each of a plurality of data paths capableof providing a data link between the first location and the secondlocation, the attempt success ratio for each data path beingrepresentative of a proportion of successful linkages by the data pathto all attempted linkages by the data path between the first locationand the second location; obtaining a revenue value for each of theplurality of data paths, the revenue value for each data path beingrepresentative of an amount per unit generated by a successful linkageby the data path between the first location and the second location;computing a comparative income value for each of the plurality of datapaths, the comparative income value for each data path being a productof the attempt success ratio for the data path and the revenue value forthe data path; and selecting routing information for routing the databetween the first location and the second location based on thecomparative income value for each of the data paths, wherein the routinginformation may be employed to route the data by way of at least one ofthe data paths.
 2. The method of claim 1 for dynamically routing atelephone call between a first location and a second location, themethod comprising: obtaining an attempt success ratio for each of aplurality of telephone paths capable of providing a telephone linkbetween the first location and the second location, the attempt successratio for each telephone path being representative of a proportion ofsuccessful linkages by the telephone path to all attempted linkages bythe telephone path between the first location and the second location;obtaining a revenue value for each of the plurality of telephone paths,the revenue value for each telephone path being representative of anamount per unit generated by a successful linkage by the telephone pathbetween the first location and the second location; computing acomparative income value for each of the plurality of telephone paths,the comparative income value for each telephone path being a product ofthe attempt success ratio for the telephone path and the revenue valuefor the telephone path; selecting routing information for routing thetelephone call between the first location and the second location basedon the comparative income value for each of the telephone paths, whereinthe routing information may be employed to route the telephone call byway of at least one of the telephone paths.
 3. The method of claim 2further comprising: transmitting the routing information to a centraloffice; and routing the telephone call at the central office accordingto the transmitted routing information.
 4. The method of claim 2 fordynamically routing a telephone call between a first location and asecond location, the method comprising: obtaining an attempt successratio for each of a plurality of trunk lines capable of providing atelephone link between the first location and the second location, theattempt success ratio for each trunk line being representative of aproportion of successful linkages by the trunk line to all attemptedlinkages by the trunk line between the first location and the secondlocation; obtaining a revenue value for each of the plurality of trunklines, the revenue value for each trunk line being representative of anamount per unit generated by a successful linkage by the trunk linebetween the first location and the second location; computing acomparative income value for each of the plurality of trunk lines, thecomparative income value for each trunk line being a product of theattempt success ratio for the trunk line and the revenue value for thetrunk line; selecting routing information for routing the telephone callbetween the first location and the second location based on thecomparative income value for each of the trunk lines, wherein therouting information may be employed to route the telephone call by wayof at least one of the trunk lines.
 5. The method of claim 1, whereinobtaining the revenue value for each of a plurality of data pathscomprises obtaining a value selected from a group consisting of leastcost per minute, most revenue per minute and most profit per minute. 6.The method of claim 1 further comprising: transmitting the routinginformation to a routing device; and routing the data at the routingdevice according to the transmitted routing information.
 7. The methodof claim 1, the method comprising obtaining both the attempt successratio and the revenue value for each data path from a database.
 8. Themethod of claim 7, the method further comprising storing the comparativeincome value for each data path in the database.
 9. The method of claim7 further comprising updating the database periodically with a currentattempt success ratio for each data path and a current revenue value foreach data path.
 10. The method of claim 9, comprising updating thedatabase periodically with the current attempt success ratio for eachdata path and the current revenue value for each data path as obtainedfrom a surveillance system that monitors such current attempt successratio and such current revenue value.
 11. The method of claim 1, whereinselecting the routing information further comprises: selecting a firstrouting information for routing the data by way of a first data path;and selecting a second routing information for routing the data by wayof a second data path.
 12. The method of claim 11, comprising: selectingthe first routing information for routing the data by way of a preferreddata path; and selecting a second routing information for routing thedata by way of an alternative data path.
 13. A computer havinginstructions thereon for dynamically routing data between a firstlocation and a second location, the instructions being organized intomodules comprising: a first module for obtaining an attempt successratio for each of a plurality of data paths capable of providing a datalink between the first location and the second location, the attemptsuccess ratio for each data path being representative of a proportion ofsuccessful linkages by the data path to all attempted linkages by thedata path between the first location and the second location; a secondmodule for obtaining a revenue value for each of the plurality of datapaths, the revenue value for each data path being representative of anamount per unit generated by a successful linkage by the data pathbetween the first location and the second location; a third module forcomputing a comparative income value for each of the plurality of datapaths, the comparative income value for each data path being a productof the attempt success ratio for the data path and the revenue value forthe data path; and a fourth module for selecting routing information forrouting the data between the first location and the second locationbased on the comparative income value for each of the data paths,wherein the routing information may be employed to route the data by wayof at least one of the data paths.
 14. The computer of claim 13 fordynamically routing a telephone call between a first location and asecond location, the computer comprising: a first module for obtainingan attempt success ratio for each of a plurality of telephone pathscapable of providing a telephone link between the first location and thesecond location, the attempt success ratio for each telephone path beingrepresentative of a proportion of successful linkages by the telephonepath to all attempted linkages by the telephone path between the firstlocation and the second location; a second module for obtaining arevenue value for each of the plurality of telephone paths, the revenuevalue for each telephone path being representative of an amount per unitgenerated by a successful linkage by the telephone path between thefirst location and the second location; a third module for computing acomparative income value for each of the plurality of telephone paths,the comparative income value for each telephone path being a product ofthe attempt success ratio for the telephone path and the revenue valuefor the telephone path; and a fourth module for selecting routinginformation for routing the telephone call between the first locationand the second location based on the comparative income value for eachof the telephone paths, wherein the routing information may be employedto route the telephone call by way of at least one of the telephonepaths.
 15. The computer of claim 14 for dynamically routing a telephonecall between a first location and a second location, the computercomprising: a first module for obtaining an attempt success ratio foreach of a plurality of trunk lines capable of providing a telephone linkbetween the first location and the second location, the attempt successratio for each trunk line being representative of a proportion ofsuccessful linkages by the trunk line to all attempted linkages by thetrunk line between the first location and the second location; a secondmodule for obtaining a revenue value for each of the plurality of trunklines, the revenue value for each trunk line being representative of anamount per unit generated by a successful linkage by the trunk linebetween the first location and the second location; a third module forcomputing a comparative income value for each of the plurality of trunklines, the comparative income value for each trunk line being a productof the attempt success ratio for the trunk line and the revenue valuefor the trunk line; and a fourth module for selecting routinginformation for routing the telephone call between the first locationand the second location based on the comparative income value for eachof the trunk lines, wherein the routing information may be employed toroute the telephone call by way of at least one of the trunk lines. 16.The computer of claim 13, wherein the second module for obtaining therevenue value for each of a plurality of data paths comprises obtaininga value selected from a group consisting of least cost per minute, mostrevenue per minute and most profit per minute.
 17. The computer of claim13 further comprising a module for transmitting the routing informationto a routing device, wherein the routing device may route the dataaccording to the transmitted routing information.
 18. The computer ofclaim 13 wherein the first module and the second module obtain theattempt success ratio and the revenue value for each data path from adatabase.
 19. The computer of claim 18 further comprising a module forstoring the comparative income value for each data path in the database.20. The computer of claim 18 wherein the first module and the secondmodule obtain the attempt success ratio and the revenue value for eachdata path from a database that is periodically updated with a currentattempt success ratio for each data path and a current revenue value foreach data path.
 21. The computer of claim 20, wherein the first moduleand the second module obtain the attempt success ratio and the revenuevalue for each data path from a database that is periodically updatedwith a current attempt success ratio for each data path and a currentrevenue value for each data path as obtained from a surveillance systemthat monitors such current attempt success ratio and such currentrevenue value.
 22. The computer of claim 13 wherein the fourth moduleselects the routing information by selecting a first routing informationfor routing the data by way of a first data path; and then selecting asecond routing information for routing the data by way of a second datapath.
 23. The computer of claim 22, wherein the fourth module selectsthe first routing information for routing the data by way of a preferreddata path; and selects a second routing information for routing the databy way of an alternative data path.